Voronoi cells via linear inequality systems

Newton's method for linear inequality systems

We describe a modified Newton type algorithm for the solution of linear inequality systems in the sense of minimizing the /, norm of infeasibilities. Finite termination is proved, and numerical results are given.

Uniform Saturation in Linear Inequality Systems

Redundant constraints in linear inequality systems can be characterized as those inequalities that can be removed from an arbitrary linear optimization problem posed on its solution set without modifying its value and its optimal set. A constraint is saturated in a given linear optimization problem when it is binding at the optimal set. Saturation is a property related with the preservation of ...

Explicit ABS Solution of a Class of Linear Inequality Systems and LP Problems

Numerical method for solving optimal control problem of the linear differential systems with inequality constraints

In this paper, an efficient method for solving optimal control problems of the linear differential systems with inequality constraint is proposed. By using new adjustment of hat basis functions and their operational matrices of integration, optimal control problem is reduced to an optimization problem. Also, the error analysis of the proposed method is nvestigated and it is proved that the orde...

Voronoi Diagrams in Linear Time ∗

Voronoi diagrams are a well-studied data structure of proximity information, and although most cases require Ω(n log n) construction time, it is interesting and useful to develop linear-time algorithms for certain Voronoi diagrams. We develop a linear-time algorithm for abstract Voronoi diagrams in a domain where each site has a unique face and no pair of bisectors intersect outside the domain....